Super-simple Steiner pentagon systems
نویسندگان
چکیده
منابع مشابه
Steiner pentagon covering designs
Let Kn denote the complete undirected graph on n vertices. A Steiner pentagon covering design (SPCD) of order n is a pair (Kn;B), where B is a collection of c(n)= n=5 n−1=2 pentagons from Kn such that any two vertices are joined by a path of length 1 in at least one pentagon of B, and also by a path of length 2 in at least one pentagon of B. The existence of SPCDs is investigated. The main appr...
متن کاملSystem Engineering Implementation Process for Super-Systems
System engineering is one of the most powerful tools for comprehensive project management and control. This tool emphasized the life cycle of the projects, manages every single activity and helps manage the main elements of the project through a set of management and engineering processes. The goal of the current study is to use a system engineering approach in design phase in order or to meet ...
متن کاملSteiner Minimal Trees in Simple Polygons
An O(n log n) time and O(n) space algorithm for the Euclidean Steiner tree problem with four terminals in a simple polygon with n vertices is given. Its applicability to the problem of determining good quality solutions for any number of terminals is discussed.
متن کاملBicoloring Steiner Triple Systems
A Steiner triple system has a bicoloring with m color classes if the points are partitioned into m subsets and the three points in every block are contained in exactly two of the color classes. In this paper we give necessary conditions for the existence of a bicoloring with 3 color classes and give a multiplication theorem for Steiner triple systems with 3 color classes. We also examine bicolo...
متن کاملBalanced Steiner Triple Systems
A Steiner triple system of order v (briefly STS(v)) is a pair (X, B), where X is a v-element set and B is a collection of 3-subsets of X (triples), such that every pair of X is contained in exactly one triple of B. It is well known that a necessary and sufficient condition for a STS(v) to exist is that v#1 or 3 (mod 6). An r-coloring of a STS(v) is a map , : X [1, ..., r] such that at least two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.08.016